Gossiping without Duplicate Transmissions
نویسندگان
چکیده
منابع مشابه
Request-Based Gossiping without Deadlocks
By the distributed averaging problem is meant the problem of computing the average value of a set of numbers possessed by the agents in a distributed network using only communication between neighboring agents. Gossiping is a well-known approach to the problem which seeks to iteratively arrive at a solution by allowing each agent to interchange information with at most one neighbor at each iter...
متن کاملGossiping Capabilities
Gossip-based protocols are now acknowledged as a sound basis to implement collaborative high-bandwidth content dissemination: content location is disseminated through gossip, the actual contents being subsequently pulled. In this paper, we present HEAP, HEterogeneity-Aware Gossip Protocol, where nodes dynamically adjust their contribution to gossip dissemination according to their capabilities....
متن کاملDuplicate Publication Duplicate Publication Duplicate Publication
priorities permit. The comments should not exceed 350 words in length, with a maximum of five references; one figure or table can be printed. Exceptions may occur under particular circumstances. Contributions may include comments on articles published in this periodical, or they may be reports of unique educational character. Please include a cover letter with a complete list of authors (includ...
متن کاملDetection of direct sequence spread spectrum transmissions without prior knowledge
Direct sequence spread spectrum transmissions (DSSS) are now widely used for secure communications, as well as for multiple access. Since the transmission uses a large bandwidth, the power spectral density of a DS-SS signal can be below the noise level. Hence, such a signal is difficult to detect. In this paper, we propose a method which is able to detect a spread spectrum signal hidden in the ...
متن کاملGossiping in circulant graphs Gossiping in circulant graphs
ENG) We investigate the gossiping problem, in which nodes of an intercommunication network share information initially given to each one of them according to a communication protocol by rounds. We consider two types of communication protocols: vertex-disjoint path mode, and edge-disjoint path mode. We give a general lower bound on the complexity of gossiping algorithms in terms of the isoperime...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: SIAM Journal on Algebraic Discrete Methods
سال: 1982
ISSN: 0196-5212,2168-345X
DOI: 10.1137/0603042